Departure Process of the MAP/SM/1 Queue

نویسنده

  • Shigeo Shioda
چکیده

We study the departure process of a single server queue with Markovian arrival input and Markov renewal service time. We derive the joint transform of departure time and the number of departures and, based on this transform, we establish several expressions for burstiness (variance) and correlation (covariance sequence) of the departure process. These expressions reveal that burstiness and correlation of the arrival process have very little impact on the departure process when a queueing system is heavily loaded. In contrast, both burstiness and correlation of the service-time process greatly affect those of the departure process regardless of the load of the system. Finally, we show that, even when an arrival process is short-range dependent, the departure process could has long-range dependence if a service-time process is long-range dependent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Departure Processes of a Tandem Network

Consider a 2-stage single-server tandem queue with a MAP to the first stage and the exponential service times. Using the DREB scheme, we formulate the joint queue length process into a single-dimensional level-dependent quasi-birth-death (LDQBD) process with expanding blocks. This allows us to show that the departure process from stage 1 is a MAP with infinite phases or IMAP and that the depart...

متن کامل

Departure process analysis of the multi-type MMAP[K]/PH[K]/1 FCFS queue

Departure process analysis of the multi-type MMAP[K]/PH[K]/1 FCFS queue a b s t r a c t The analysis of the departure process of queues is important in several aspects, for instance, it plays a prominent role in the decomposition based analysis of open queueing networks. While there are several results available for the departure process analysis of MAP driven single-class (or, single-type) que...

متن کامل

Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation1

We propose a family of finite approximations for the departure process of a BMAP/MAP/1 queue. The departure process approximations are derived via an exact aggregate solution technique (called ETAQA) applied to M/G/1-type Markov processes. The proposed approximations are indexed by a parameter , which determines the size of the output model as block levels of the M/G/1-type process. This output...

متن کامل

Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes

A single-server queueing system with a batch Markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been det...

متن کامل

A Preemptive Priority Queue as a Model with Server Vacations

We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2003